Unlinking Information from 4-manifolds
نویسنده
چکیده
We generalise theorems of Cochran-Lickorish and Owens-Strle to the case of links with more than one component. This enables the use of linking forms on double branched covers, Heegaard Floer correction terms, and Donaldson’s diagonalisation theorem to complete the table of unlinking numbers for nonsplit prime links with crossing number nine or less.
منابع مشابه
Unlinking Number and Unlinking Gap
After introducing the Bernhard-Jablan Conjecture, we computed rational links with an unlinking gap for n ≤ 16 crossings. Several new infinite multi-parameter families of rational knots and links with unlinking gap are described. The general principle for the construction of infinite families of links with an unlinking gap is proposed. New infinite families of polyhedral alternating links with u...
متن کاملA Geometry Preserving Kernel over Riemannian Manifolds
Abstract- Kernel trick and projection to tangent spaces are two choices for linearizing the data points lying on Riemannian manifolds. These approaches are used to provide the prerequisites for applying standard machine learning methods on Riemannian manifolds. Classical kernels implicitly project data to high dimensional feature space without considering the intrinsic geometry of data points. ...
متن کاملFtsK-dependent XerCD-dif recombination unlinks replication catenanes in a stepwise manner.
In Escherichia coli, complete unlinking of newly replicated sister chromosomes is required to ensure their proper segregation at cell division. Whereas replication links are removed primarily by topoisomerase IV, XerC/XerD-dif site-specific recombination can mediate sister chromosome unlinking in Topoisomerase IV-deficient cells. This reaction is activated at the division septum by the DNA tran...
متن کاملCombining Left and Right Unlinking for Matching a Large Number of Learned Rules
In systems which learn a large number of rules (productions), it is important to match the rules e ciently, in order to avoid the machine learning utility problem | if the learned rules slow down the matcher, the \learning" can slow the whole system down to a crawl. So we need match algorithms that scale well with the number of productions in the system. (Doorenbos, 1993) introduced right unlin...
متن کاملبهبود مدل تفکیککننده منیفلدهای غیرخطی بهمنظور بازشناسی چهره با یک تصویر از هر فرد
Manifold learning is a dimension reduction method for extracting nonlinear structures of high-dimensional data. Many methods have been introduced for this purpose. Most of these methods usually extract a global manifold for data. However, in many real-world problems, there is not only one global manifold, but also additional information about the objects is shared by a large number of manifolds...
متن کامل